Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Computer security and cryptography [[electronic resource] /] / Alan G. Konheim
| Computer security and cryptography [[electronic resource] /] / Alan G. Konheim |
| Autore | Konheim Alan G. <1934-> |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Hoboken, N.J., : Wiley-Interscience, c2007 |
| Descrizione fisica | 1 online resource (541 p.) |
| Disciplina | 005.8 |
| Soggetto topico |
Computer security
Cryptography |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-280-82189-2
9786610821891 0-470-08398-0 0-470-08397-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
COMPUTER SECURITY AND CRYPTOGRAPHY; CONTENTS; FOREWORD; PREFACE; ACKNOWLEDGMENTS; ABOUT THE AUTHOR; CHAPTER 1 APERITIFS; 1.1 The Lexicon of Cryptography; 1.2 Cryptographic Systems; 1.3 Cryptanalysis; 1.4 Side Information; 1.5 Thomas Jefferson and the M-94; 1.6 Cryptography and History; 1.7 Cryptography and Computers; 1.8 The National Security Agency; 1.9 The Giants; 1.10 No Sex, Money, Crime or . . . Love; 1.11 An Example of the Inference Process in Cryptanalysis; 1.12 Warning!; CHAPTER 2 COLUMNAR TRANSPOSITION; 2.1 Shannon's Classification of Secrecy Transformations
2.2 The Rules of Columnar Transposition Encipherment2.3 Cribbing; 2.4 Examples of Cribbing; 2.5 Plaintext Language Models; 2.6 Counting k-Grams; 2.7 Deriving the Parameters of a Markov Model from Sliding Window Counts; 2.8 Markov Scoring; 2.9 The ADFGVX Transposition System; 2.10 CODA; 2.11 Columnar Transposition Problems; CHAPTER 3 MONOALPHABETIC SUBSTITUTION; 3.1 Monoalphabetic Substitution; 3.2 Caesar's Cipher; 3.3 Cribbing Using Isomorphs; 3.4 The x(2)-Test of a Hypothesis; 3.5 Pruning from the Table of Isomorphs; 3.6 Partial Maximum Likelihood Estimation of a Monoalphabetic Substitution 3.7 The Hidden Markov Model (HMM)3.8 Hill Encipherment of ASCII N-Grams; 3.9 Gaussian Elimination; 3.10 Monoalphabetic Substitution Problems; CHAPTER 4 POLYALPHABETIC SUBSTITUTION; 4.1 Running Keys; 4.2 Blaise de Vigenère; 4.3 Gilbert S. Vernam; 4.4 The One-Time Pad; 4.5 Finding the Key of Vernam-Vigenère Ciphertext with Known Period by Correlation; 4.6 Coincidence; 4.7 Venona; 4.8 Polyalphabetic Substitution Problems; CHAPTER 5 STATISTICAL TESTS; 5.1 Weaknesses in a Cryptosystem; 5.2 The Kolmogorov-Smirnov Test; 5.3 NIST's Proposed Statistical Tests; 5.4 Diagnosis 5.5 Statistical Tests ProblemsCHAPTER 6 THE EMERGENCE OF CIPHER MACHINES; 6.1 The Rotor; 6.2 Rotor Systems; 6.3 Rotor Patents; 6.4 A Characteristic Property of Conjugacy; 6.5 Analysis of a 1-Rotor System: Ciphertext Only; 6.6 The Displacement Sequence of a Permutation; 6.7 Arthur Scherbius; 6.8 Enigma Key Distribution Protocol; 6.9 Cryptanalysis of the Enigma; 6.10 Cribbing Enigma Ciphertext; 6.11 The Lorenz Schlüsselzusatz; 6.12 The SZ40 Pin Wheels; 6.13 SZ40 Cryptanalysis Problems; 6.14 Cribbing SZ40 Ciphertext; CHAPTER 7 THE JAPANESE CIPHER MACHINES; 7.1 Japanese Signaling Conventions 7.2 Half-Rotors7.3 Components of the RED Machine; 7.4 Cribbing RED Ciphertext; 7.5 Generalized Vowels and Consonants; 7.6 "Climb Mount Itaka" - War!; 7.7 Components of the PURPLE Machine; 7.8 The PURPLE Keys; 7.9 Cribbing PURPLE: Finding the V-Stepper; 7.10 Cribbing PURPLE: Finding the C-Steppers; CHAPTER 8 STREAM CIPHERS; 8.1 Stream Ciphers; 8.2 Feedback Shift Registers; 8.3 The Algebra of Polynomials over Z(2); 8.4 The Characteristic Polynomial of a Linear Feedback Shift Register; 8.5 Properties of Maximal Length LFSR Sequences; 8.6 Linear Equivalence 8.7 Combining Multiple Linear Feedback Shift Registers |
| Record Nr. | UNINA-9910143434303321 |
Konheim Alan G. <1934->
|
||
| Hoboken, N.J., : Wiley-Interscience, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer security and cryptography / / Alan G. Konheim
| Computer security and cryptography / / Alan G. Konheim |
| Autore | Konheim Alan G. <1934-> |
| Edizione | [1st edition.] |
| Pubbl/distr/stampa | Hoboken, N.J. : , : Wiley-Interscience, , [2007] |
| Descrizione fisica | 1 online resource (541 pages) |
| Disciplina | 005.8 |
| Soggetto topico |
Computer security
Cryptography |
| ISBN |
1-280-82189-2
9786610821891 0-470-08398-0 0-470-08397-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
1 APERITIFS; 1.1 The Lexicon of Cryptography; 1.2 Cryptographic Systems; 1.3 Cryptanalysis; 1.4 Side Information; 1.5 Thomas Jefferson and the M-94; 1.6 Cryptography and History; 1.7 Cryptography and Computers; 1.8 The National Security Agency; 1.9 The Giants; 1.10 No Sex, Money, Crime or . . . Love; 1.11 An Example of the Inference Process in Cryptanalysis; 1.12 Warning!; CHAPTER 2 COLUMNAR TRANSPOSITION; 2.1 Shannon's Classification of Secrecy Transformations
2.2 The Rules of Columnar Transposition Encipherment2.3 Cribbing; 2.4 Examples of Cribbing; 2.5 Plaintext Language Models; 2.6 Counting k-Grams; 2.7 Deriving the Parameters of a Markov Model from Sliding Window Counts; 2.8 Markov Scoring; 2.9 The ADFGVX Transposition System; 2.10 CODA; 2.11 Columnar Transposition Problems; CHAPTER 3 MONOALPHABETIC SUBSTITUTION; 3.1 Monoalphabetic Substitution; 3.2 Caesar's Cipher; 3.3 Cribbing Using Isomorphs; 3.4 The x(2)-Test of a Hypothesis; 3.5 Pruning from the Table of Isomorphs; 3.6 Partial Maximum Likelihood Estimation of a Monoalphabetic Substitution 3.7 The Hidden Markov Model (HMM)3.8 Hill Encipherment of ASCII N-Grams; 3.9 Gaussian Elimination; 3.10 Monoalphabetic Substitution Problems; CHAPTER 4 POLYALPHABETIC SUBSTITUTION; 4.1 Running Keys; 4.2 Blaise de Vigenère; 4.3 Gilbert S. Vernam; 4.4 The One-Time Pad; 4.5 Finding the Key of Vernam-Vigenère Ciphertext with Known Period by Correlation; 4.6 Coincidence; 4.7 Venona; 4.8 Polyalphabetic Substitution Problems; CHAPTER 5 STATISTICAL TESTS; 5.1 Weaknesses in a Cryptosystem; 5.2 The Kolmogorov-Smirnov Test; 5.3 NIST's Proposed Statistical Tests; 5.4 Diagnosis 5.5 Statistical Tests ProblemsCHAPTER 6 THE EMERGENCE OF CIPHER MACHINES; 6.1 The Rotor; 6.2 Rotor Systems; 6.3 Rotor Patents; 6.4 A Characteristic Property of Conjugacy; 6.5 Analysis of a 1-Rotor System: Ciphertext Only; 6.6 The Displacement Sequence of a Permutation; 6.7 Arthur Scherbius; 6.8 Enigma Key Distribution Protocol; 6.9 Cryptanalysis of the Enigma; 6.10 Cribbing Enigma Ciphertext; 6.11 The Lorenz Schlüsselzusatz; 6.12 The SZ40 Pin Wheels; 6.13 SZ40 Cryptanalysis Problems; 6.14 Cribbing SZ40 Ciphertext; CHAPTER 7 THE JAPANESE CIPHER MACHINES; 7.1 Japanese Signaling Conventions 7.2 Half-Rotors7.3 Components of the RED Machine; 7.4 Cribbing RED Ciphertext; 7.5 Generalized Vowels and Consonants; 7.6 "Climb Mount Itaka" - War!; 7.7 Components of the PURPLE Machine; 7.8 The PURPLE Keys; 7.9 Cribbing PURPLE: Finding the V-Stepper; 7.10 Cribbing PURPLE: Finding the C-Steppers; CHAPTER 8 STREAM CIPHERS; 8.1 Stream Ciphers; 8.2 Feedback Shift Registers; 8.3 The Algebra of Polynomials over Z(2); 8.4 The Characteristic Polynomial of a Linear Feedback Shift Register; 8.5 Properties of Maximal Length LFSR Sequences; 8.6 Linear Equivalence 8.7 Combining Multiple Linear Feedback Shift Registers. |
| Record Nr. | UNINA-9910643065403321 |
|
Konheim Alan G. <1934->
|
||
| Hoboken, N.J. : , : Wiley-Interscience, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer security and cryptography / / Alan G. Konheim
| Computer security and cryptography / / Alan G. Konheim |
| Autore | Konheim Alan G. <1934-> |
| Edizione | [1st edition.] |
| Pubbl/distr/stampa | Hoboken, N.J. : , : Wiley-Interscience, , [2007] |
| Descrizione fisica | 1 online resource (541 pages) |
| Disciplina | 005.8 |
| Soggetto topico |
Computer security
Cryptography |
| ISBN |
1-280-82189-2
9786610821891 0-470-08398-0 0-470-08397-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
1 APERITIFS; 1.1 The Lexicon of Cryptography; 1.2 Cryptographic Systems; 1.3 Cryptanalysis; 1.4 Side Information; 1.5 Thomas Jefferson and the M-94; 1.6 Cryptography and History; 1.7 Cryptography and Computers; 1.8 The National Security Agency; 1.9 The Giants; 1.10 No Sex, Money, Crime or . . . Love; 1.11 An Example of the Inference Process in Cryptanalysis; 1.12 Warning!; CHAPTER 2 COLUMNAR TRANSPOSITION; 2.1 Shannon's Classification of Secrecy Transformations
2.2 The Rules of Columnar Transposition Encipherment2.3 Cribbing; 2.4 Examples of Cribbing; 2.5 Plaintext Language Models; 2.6 Counting k-Grams; 2.7 Deriving the Parameters of a Markov Model from Sliding Window Counts; 2.8 Markov Scoring; 2.9 The ADFGVX Transposition System; 2.10 CODA; 2.11 Columnar Transposition Problems; CHAPTER 3 MONOALPHABETIC SUBSTITUTION; 3.1 Monoalphabetic Substitution; 3.2 Caesar's Cipher; 3.3 Cribbing Using Isomorphs; 3.4 The x(2)-Test of a Hypothesis; 3.5 Pruning from the Table of Isomorphs; 3.6 Partial Maximum Likelihood Estimation of a Monoalphabetic Substitution 3.7 The Hidden Markov Model (HMM)3.8 Hill Encipherment of ASCII N-Grams; 3.9 Gaussian Elimination; 3.10 Monoalphabetic Substitution Problems; CHAPTER 4 POLYALPHABETIC SUBSTITUTION; 4.1 Running Keys; 4.2 Blaise de Vigenère; 4.3 Gilbert S. Vernam; 4.4 The One-Time Pad; 4.5 Finding the Key of Vernam-Vigenère Ciphertext with Known Period by Correlation; 4.6 Coincidence; 4.7 Venona; 4.8 Polyalphabetic Substitution Problems; CHAPTER 5 STATISTICAL TESTS; 5.1 Weaknesses in a Cryptosystem; 5.2 The Kolmogorov-Smirnov Test; 5.3 NIST's Proposed Statistical Tests; 5.4 Diagnosis 5.5 Statistical Tests ProblemsCHAPTER 6 THE EMERGENCE OF CIPHER MACHINES; 6.1 The Rotor; 6.2 Rotor Systems; 6.3 Rotor Patents; 6.4 A Characteristic Property of Conjugacy; 6.5 Analysis of a 1-Rotor System: Ciphertext Only; 6.6 The Displacement Sequence of a Permutation; 6.7 Arthur Scherbius; 6.8 Enigma Key Distribution Protocol; 6.9 Cryptanalysis of the Enigma; 6.10 Cribbing Enigma Ciphertext; 6.11 The Lorenz Schlüsselzusatz; 6.12 The SZ40 Pin Wheels; 6.13 SZ40 Cryptanalysis Problems; 6.14 Cribbing SZ40 Ciphertext; CHAPTER 7 THE JAPANESE CIPHER MACHINES; 7.1 Japanese Signaling Conventions 7.2 Half-Rotors7.3 Components of the RED Machine; 7.4 Cribbing RED Ciphertext; 7.5 Generalized Vowels and Consonants; 7.6 "Climb Mount Itaka" - War!; 7.7 Components of the PURPLE Machine; 7.8 The PURPLE Keys; 7.9 Cribbing PURPLE: Finding the V-Stepper; 7.10 Cribbing PURPLE: Finding the C-Steppers; CHAPTER 8 STREAM CIPHERS; 8.1 Stream Ciphers; 8.2 Feedback Shift Registers; 8.3 The Algebra of Polynomials over Z(2); 8.4 The Characteristic Polynomial of a Linear Feedback Shift Register; 8.5 Properties of Maximal Length LFSR Sequences; 8.6 Linear Equivalence 8.7 Combining Multiple Linear Feedback Shift Registers. |
| Record Nr. | UNINA-9910830861203321 |
|
Konheim Alan G. <1934->
|
||
| Hoboken, N.J. : , : Wiley-Interscience, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Computer security and cryptography / / Alan G. Konheim
| Computer security and cryptography / / Alan G. Konheim |
| Autore | Konheim Alan G. <1934-> |
| Edizione | [1st edition.] |
| Pubbl/distr/stampa | Hoboken, N.J. : , : Wiley-Interscience, , [2007] |
| Descrizione fisica | 1 online resource (541 pages) |
| Disciplina | 005.8 |
| Soggetto topico |
Computer security
Cryptography |
| ISBN |
1-280-82189-2
9786610821891 0-470-08398-0 0-470-08397-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
1 APERITIFS; 1.1 The Lexicon of Cryptography; 1.2 Cryptographic Systems; 1.3 Cryptanalysis; 1.4 Side Information; 1.5 Thomas Jefferson and the M-94; 1.6 Cryptography and History; 1.7 Cryptography and Computers; 1.8 The National Security Agency; 1.9 The Giants; 1.10 No Sex, Money, Crime or . . . Love; 1.11 An Example of the Inference Process in Cryptanalysis; 1.12 Warning!; CHAPTER 2 COLUMNAR TRANSPOSITION; 2.1 Shannon's Classification of Secrecy Transformations
2.2 The Rules of Columnar Transposition Encipherment2.3 Cribbing; 2.4 Examples of Cribbing; 2.5 Plaintext Language Models; 2.6 Counting k-Grams; 2.7 Deriving the Parameters of a Markov Model from Sliding Window Counts; 2.8 Markov Scoring; 2.9 The ADFGVX Transposition System; 2.10 CODA; 2.11 Columnar Transposition Problems; CHAPTER 3 MONOALPHABETIC SUBSTITUTION; 3.1 Monoalphabetic Substitution; 3.2 Caesar's Cipher; 3.3 Cribbing Using Isomorphs; 3.4 The x(2)-Test of a Hypothesis; 3.5 Pruning from the Table of Isomorphs; 3.6 Partial Maximum Likelihood Estimation of a Monoalphabetic Substitution 3.7 The Hidden Markov Model (HMM)3.8 Hill Encipherment of ASCII N-Grams; 3.9 Gaussian Elimination; 3.10 Monoalphabetic Substitution Problems; CHAPTER 4 POLYALPHABETIC SUBSTITUTION; 4.1 Running Keys; 4.2 Blaise de Vigenère; 4.3 Gilbert S. Vernam; 4.4 The One-Time Pad; 4.5 Finding the Key of Vernam-Vigenère Ciphertext with Known Period by Correlation; 4.6 Coincidence; 4.7 Venona; 4.8 Polyalphabetic Substitution Problems; CHAPTER 5 STATISTICAL TESTS; 5.1 Weaknesses in a Cryptosystem; 5.2 The Kolmogorov-Smirnov Test; 5.3 NIST's Proposed Statistical Tests; 5.4 Diagnosis 5.5 Statistical Tests ProblemsCHAPTER 6 THE EMERGENCE OF CIPHER MACHINES; 6.1 The Rotor; 6.2 Rotor Systems; 6.3 Rotor Patents; 6.4 A Characteristic Property of Conjugacy; 6.5 Analysis of a 1-Rotor System: Ciphertext Only; 6.6 The Displacement Sequence of a Permutation; 6.7 Arthur Scherbius; 6.8 Enigma Key Distribution Protocol; 6.9 Cryptanalysis of the Enigma; 6.10 Cribbing Enigma Ciphertext; 6.11 The Lorenz Schlüsselzusatz; 6.12 The SZ40 Pin Wheels; 6.13 SZ40 Cryptanalysis Problems; 6.14 Cribbing SZ40 Ciphertext; CHAPTER 7 THE JAPANESE CIPHER MACHINES; 7.1 Japanese Signaling Conventions 7.2 Half-Rotors7.3 Components of the RED Machine; 7.4 Cribbing RED Ciphertext; 7.5 Generalized Vowels and Consonants; 7.6 "Climb Mount Itaka" - War!; 7.7 Components of the PURPLE Machine; 7.8 The PURPLE Keys; 7.9 Cribbing PURPLE: Finding the V-Stepper; 7.10 Cribbing PURPLE: Finding the C-Steppers; CHAPTER 8 STREAM CIPHERS; 8.1 Stream Ciphers; 8.2 Feedback Shift Registers; 8.3 The Algebra of Polynomials over Z(2); 8.4 The Characteristic Polynomial of a Linear Feedback Shift Register; 8.5 Properties of Maximal Length LFSR Sequences; 8.6 Linear Equivalence 8.7 Combining Multiple Linear Feedback Shift Registers. |
| Record Nr. | UNINA-9910841204503321 |
|
Konheim Alan G. <1934->
|
||
| Hoboken, N.J. : , : Wiley-Interscience, , [2007] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Cryptography : a primer / Alan G. Konheim
| Cryptography : a primer / Alan G. Konheim |
| Autore | Konheim, Alan G. |
| Pubbl/distr/stampa | New York : Wiley & sons, ©1981 |
| Descrizione fisica | XIV, 432 p. : ill. ; 24 cm |
| Disciplina | 001.54'36 |
| Soggetto non controllato |
Crittografia
Computer - Controllo degli accessi Telecomunicazioni - Misure di sicurezza |
| ISBN | 0-471-08132-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990000520820403321 |
|
Konheim, Alan G.
|
||
| New York : Wiley & sons, ©1981 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hashing in computer science : fifty years of slicing and dicing / / Alan G. Konheim
| Hashing in computer science : fifty years of slicing and dicing / / Alan G. Konheim |
| Autore | Konheim Alan G. <1934-> |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Hoboken, New Jersey : , : John Wiley & Sons, , c2010 |
| Descrizione fisica | 1 online resource (406 p.) |
| Disciplina | 005.8/2 |
| Soggetto topico |
Hashing (Computer science)
Cryptography Data encryption (Computer science) Computer security |
| ISBN |
1-118-03183-0
1-282-68627-5 9786612686276 0-470-63061-2 0-470-63060-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
PREFACE -- PART I: MATHEMATICAL PRELIMINARIES -- 1. Counting -- 1.1: The Sum and Product Rules -- 1.2: Mathematical Induction -- 1.3: Factorial -- 1.4: Binomial Coefficients -- 1.5: Multinomial Coefficients -- 1.6: Permutations -- 1.7: Combinations -- 1.8: The Principle of Inclusion-Exclusion -- 1.9: Partitions -- 1.10: Relations -- 1.11: Inverse Relations -- Appendix 1: Summations Involving Binomial Coefficients -- 2. Recurrence and Generating Functions -- 2.1: Recursions -- 2.2: Generating Functions -- 2.3: Linear Constant Coefficient Recursions -- 2.4: Solving Homogeneous LCCRs Using Generating Functions -- 2.5: The Catalan Recursion -- 2.6: The Umbral Calculus -- 2.7: Exponential Generating Functions -- 2.8: Partitions of a Set: The Bell and Stirling Numbers -- 2.9: Rouché's Theorem and the Lagrange's Inversion Formula -- 3. Asymptotic Analysis -- 3.1: Growth Notation for Sequences -- 3.2: Asymptotic Sequences and Expansions -- 3.3: Saddle Points -- 3.4: Laplace's Method -- 3.5: The Saddle Point Method -- 3.6: When Will the Saddle Point Method Work? -- 3.7: The Saddle Point Bounds -- 3.8: Examples of Saddle Point Analysis -- 4. Discrete Probability Theory -- 4.1: The Origins of Probability Theory -- 4.2: Chance Experiments, Sample Points, Spaces, and Events -- 4.3: Random Variables -- 4.4: Moments - Expectation and Variance -- 4.5: The Birthday Paradox -- 4.6: Conditional Probability and Independence -- 4.7: The Law of Large Numbers (LLN) -- 4.8: The Central Limit Theorem (CLT) -- 4.9: Random Processes and Markov Chains -- 5. Number Theory and Modern Algebra -- 5.1: Prime Numbers -- 5.2: Modular Arithmetic and the Euclidean Algorithm -- 5.3: Modular Multiplication -- 5.4: The Theorems of Fermat and Euler -- 5.5: Fields and Extension Fields -- 5.6: Factorization of Integers -- 5.7: Testing Primality -- 6. Basic Concepts of Cryptography -- 6.1: The Lexicon of Cryptography -- 6.2: Stream Ciphers -- 6.3: Block Ciphers -- 6.4: Secrecy Systems and Cryptanalysis -- 6.5: Symmetric and Two-Key Cryptographic Systems.
6.6: The Appearance of Public Key Cryptographic systems -- 6.7: A Multitude of Keys -- 6.8: The RSA Cryptosystem -- 6.9: Does PKC Solve the Problem of Key Distribution? -- 6.10: Elliptic Groups Over the Reals -- 6.11: Elliptic Groups Over the Field Zm,2 -- 6.12: Elliptic Group Cryptosystems -- 6.13: The Menezes-Vanstone Elliptic Curve Cryptosystem -- 6.14: Super-Singular Elliptic Curves -- PART II: HASHING FOR STORAGE: DATA MANAGEMENT -- 7. Basic Concepts -- 7.1: Overview of the Records Management Problem -- 7.2: A Simple Storage Management Protocol: Plain Vanilla Chaining -- 7.3: Record-Management with Sorted Keys -- 8. Hash Functions -- 8.1: The Origin of Hashing -- 8.2: Hash Tables -- 8.3: A Statistical Model for Hashing -- 8.4: The Likelihood of Collisions -- 9. Hashing Functions: Examples and Evaluation -- 9.1: Overview: The Tradeoff of Randomization Versus Computational Simplicity -- 9.2: Some Examples of Hashing Functions -- 9.3: Performance of Hash Functions: Formulation -- 9.4: The X2-Test -- 9.5: Testing a Hash Function -- 9.6: The McKenzie et al. Results -- 10. Record Chaining with Hash Tables -- 10.1: Separate Chaining of Records -- 10.2: Analysis of Separate Chaining Hashing Sequences and the Chains They Create -- 10.3: A Combinatorial Analysis of Separate Chaining -- 10.4: Coalesced Chaining -- 10.5: The Pittel-Yu Analysis of EICH Coalesced Chaining -- 10.6: To Separate or to Coalesce; and Which Version? That Is the Question -- 11. Perfect Hashing -- 11.1: Overview -- 11.2: Chichelli's Construction -- 12. The Uniform Hashing Model -- 12.1: An Idealized Hashing Model -- 12.2: The Asymptotics of Uniform Hashing -- 12.3: Collision-Free Hashing -- 13. Hashing with Linear Probing -- 13.1: Formulation and Preliminaries -- 13.2: Performance Measures for LP Hashing -- 13.3: All Cells Other than HTn-1 in the Hash-Table of n Cells are Occupied -- 13.4: m-Keys Hashed into a Hash Table of n Cells Leaving Cell HTn-1 Unoccupied -- 13.5: The Probability Distribution for the Length of a Search. 13.6: Asymptotics -- 13.7: Hashing with Linear Open Addressing: Coda -- 13.8: A Possible Improvement to Linear Probing -- 14. Double Hashing -- 14.1: Formulation of Double Hashing -- 14.2: Progressions and Strides -- 14.3: The Number of Progressions Which Fill a Hash-Table Cell -- 14.3.1: Progression Graphs -- 14.4: Dominance -- 14.5: Insertion-Cost Bounds Relating Uniform and Double Hashing -- 14.6: UsuallyDoubleHash -- 14.7: The UDH Chance Experiment and the Cost to Insert the Next Key by Double Hashing -- 14.8: Proof of Equation (14.12a) -- 14.9: UsuallyDoubleHash -- 14.10: Proof of Equation (14.12b) -- 15. Optimum Hashing -- 15.1: The Ullman / Yao Framework -- 15.1.1: The Ullman / Yao Hashing Functions -- 15.1.2: Ullman / Yao INSERT(k) and SEARCH(k) -- 15.1.3: The Ullman / Yao Statistical Model -- 15.2: The Rates at Which a Cell is Probed and Occupied -- 15.3: Partitions of (i)Scenarios, (i)Subscenarios, and Their Skeletons -- 15.3.1: (i)Subscenarios -- 15.3.2: Skeletons -- 15.4: Randomly Generated m-Scenarios -- 15.5: Bounds on Random Sums -- 15.6: Completing the Proof of Theorem 15.1 -- PART III: SOME NOVEL APPLICATIONS OF HASHING -- 16. Karp-Rabin String Searching -- 16.1: Overview -- 16.2: The Basic Karp-Rabin Hash-Fingerprint Algorithm -- 16.3: The Plain Vanilla Karp-Rabin Fingerprint Algorithm -- 16.4: Some Estimates on Prime Numbers -- 16.5: The Cost of False Matches in the Plain Vanilla Karp-Rabin Fingerprint Algorithm -- 16.6: Variations on the Plain Vanilla Karp-Rabin Fingerprint Algorithm -- 16.7: A Nonhashing Karp-Rabin Fingerprint -- 17. Hashing Rock and Roll -- 17.1: Overview of Audio Fingerprinting -- 17.2: The Basics of Fingerprinting Music -- 17.3: Haar Wavelet Coding -- 17.4: Min-Hash -- 17.5: Some Commercial Fingerprinting Products -- 18. Hashing in E-Commerce -- 18.1: The Varied Applications of Cryptography -- 18.2: Authentication -- 18.3: The Need for Certificates -- 18.4: Cryptographic Hash Functions -- 18.5: X.509 Certificates and CCIT Standardization. 18.6: The Secure Socket Layer (SSL) -- 18.7: Trust on the Web ... Trust No One Over 40! -- 18.8: MD5 -- 18.9: Criticism of MD5 -- 18.10: The Wang-Yu Collision Attack -- 18.11: Steven's Improvement to the Wang-Yu Collision Attack -- 18.12: The Chosen-Prefix Attack on MD5 -- 18.13: The Rogue CA Attack Scenario -- 18.14: The Secure Hash Algorithms -- 18.15: Criticism of SHA-1 -- 18.16: SHA-2 -- 18.17: What Now? -- Appendix 18: Sketch of the Steven's Chosen Prefix Attack -- 19. Hashing and the Secure Distribution of Digital Media -- 19.1: Overview -- 19.2: Intellectual Property (Copyrights and Patents) -- 19.3: Steganography -- 19.4: Boil, Boil, Toil ... and But First, Carefully Mix -- 19.5: Software Distribution Systems -- 19.6: Watermarks -- 19.7: An Image-Processing Technique for Watermarking -- 19.8: Using Geometric Hashing to Watermark Images -- 19.9: Biometrics and Hashing -- 19.10: The Dongle -- Appendix 19: Reed-Solomon and Hadamard Coding -- Exercises and Solutions -- INDEX. |
| Record Nr. | UNINA-9910139214003321 |
|
Konheim Alan G. <1934->
|
||
| Hoboken, New Jersey : , : John Wiley & Sons, , c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Hashing in computer science : fifty years of slicing and dicing / / Alan G. Konheim
| Hashing in computer science : fifty years of slicing and dicing / / Alan G. Konheim |
| Autore | Konheim Alan G. <1934-> |
| Edizione | [1st edition] |
| Pubbl/distr/stampa | Hoboken, New Jersey : , : John Wiley & Sons, , c2010 |
| Descrizione fisica | 1 online resource (406 p.) |
| Disciplina | 005.8/2 |
| Soggetto topico |
Hashing (Computer science)
Cryptography Data encryption (Computer science) Computer security |
| ISBN |
1-118-03183-0
1-282-68627-5 9786612686276 0-470-63061-2 0-470-63060-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
PREFACE -- PART I: MATHEMATICAL PRELIMINARIES -- 1. Counting -- 1.1: The Sum and Product Rules -- 1.2: Mathematical Induction -- 1.3: Factorial -- 1.4: Binomial Coefficients -- 1.5: Multinomial Coefficients -- 1.6: Permutations -- 1.7: Combinations -- 1.8: The Principle of Inclusion-Exclusion -- 1.9: Partitions -- 1.10: Relations -- 1.11: Inverse Relations -- Appendix 1: Summations Involving Binomial Coefficients -- 2. Recurrence and Generating Functions -- 2.1: Recursions -- 2.2: Generating Functions -- 2.3: Linear Constant Coefficient Recursions -- 2.4: Solving Homogeneous LCCRs Using Generating Functions -- 2.5: The Catalan Recursion -- 2.6: The Umbral Calculus -- 2.7: Exponential Generating Functions -- 2.8: Partitions of a Set: The Bell and Stirling Numbers -- 2.9: Rouché's Theorem and the Lagrange's Inversion Formula -- 3. Asymptotic Analysis -- 3.1: Growth Notation for Sequences -- 3.2: Asymptotic Sequences and Expansions -- 3.3: Saddle Points -- 3.4: Laplace's Method -- 3.5: The Saddle Point Method -- 3.6: When Will the Saddle Point Method Work? -- 3.7: The Saddle Point Bounds -- 3.8: Examples of Saddle Point Analysis -- 4. Discrete Probability Theory -- 4.1: The Origins of Probability Theory -- 4.2: Chance Experiments, Sample Points, Spaces, and Events -- 4.3: Random Variables -- 4.4: Moments - Expectation and Variance -- 4.5: The Birthday Paradox -- 4.6: Conditional Probability and Independence -- 4.7: The Law of Large Numbers (LLN) -- 4.8: The Central Limit Theorem (CLT) -- 4.9: Random Processes and Markov Chains -- 5. Number Theory and Modern Algebra -- 5.1: Prime Numbers -- 5.2: Modular Arithmetic and the Euclidean Algorithm -- 5.3: Modular Multiplication -- 5.4: The Theorems of Fermat and Euler -- 5.5: Fields and Extension Fields -- 5.6: Factorization of Integers -- 5.7: Testing Primality -- 6. Basic Concepts of Cryptography -- 6.1: The Lexicon of Cryptography -- 6.2: Stream Ciphers -- 6.3: Block Ciphers -- 6.4: Secrecy Systems and Cryptanalysis -- 6.5: Symmetric and Two-Key Cryptographic Systems.
6.6: The Appearance of Public Key Cryptographic systems -- 6.7: A Multitude of Keys -- 6.8: The RSA Cryptosystem -- 6.9: Does PKC Solve the Problem of Key Distribution? -- 6.10: Elliptic Groups Over the Reals -- 6.11: Elliptic Groups Over the Field Zm,2 -- 6.12: Elliptic Group Cryptosystems -- 6.13: The Menezes-Vanstone Elliptic Curve Cryptosystem -- 6.14: Super-Singular Elliptic Curves -- PART II: HASHING FOR STORAGE: DATA MANAGEMENT -- 7. Basic Concepts -- 7.1: Overview of the Records Management Problem -- 7.2: A Simple Storage Management Protocol: Plain Vanilla Chaining -- 7.3: Record-Management with Sorted Keys -- 8. Hash Functions -- 8.1: The Origin of Hashing -- 8.2: Hash Tables -- 8.3: A Statistical Model for Hashing -- 8.4: The Likelihood of Collisions -- 9. Hashing Functions: Examples and Evaluation -- 9.1: Overview: The Tradeoff of Randomization Versus Computational Simplicity -- 9.2: Some Examples of Hashing Functions -- 9.3: Performance of Hash Functions: Formulation -- 9.4: The X2-Test -- 9.5: Testing a Hash Function -- 9.6: The McKenzie et al. Results -- 10. Record Chaining with Hash Tables -- 10.1: Separate Chaining of Records -- 10.2: Analysis of Separate Chaining Hashing Sequences and the Chains They Create -- 10.3: A Combinatorial Analysis of Separate Chaining -- 10.4: Coalesced Chaining -- 10.5: The Pittel-Yu Analysis of EICH Coalesced Chaining -- 10.6: To Separate or to Coalesce; and Which Version? That Is the Question -- 11. Perfect Hashing -- 11.1: Overview -- 11.2: Chichelli's Construction -- 12. The Uniform Hashing Model -- 12.1: An Idealized Hashing Model -- 12.2: The Asymptotics of Uniform Hashing -- 12.3: Collision-Free Hashing -- 13. Hashing with Linear Probing -- 13.1: Formulation and Preliminaries -- 13.2: Performance Measures for LP Hashing -- 13.3: All Cells Other than HTn-1 in the Hash-Table of n Cells are Occupied -- 13.4: m-Keys Hashed into a Hash Table of n Cells Leaving Cell HTn-1 Unoccupied -- 13.5: The Probability Distribution for the Length of a Search. 13.6: Asymptotics -- 13.7: Hashing with Linear Open Addressing: Coda -- 13.8: A Possible Improvement to Linear Probing -- 14. Double Hashing -- 14.1: Formulation of Double Hashing -- 14.2: Progressions and Strides -- 14.3: The Number of Progressions Which Fill a Hash-Table Cell -- 14.3.1: Progression Graphs -- 14.4: Dominance -- 14.5: Insertion-Cost Bounds Relating Uniform and Double Hashing -- 14.6: UsuallyDoubleHash -- 14.7: The UDH Chance Experiment and the Cost to Insert the Next Key by Double Hashing -- 14.8: Proof of Equation (14.12a) -- 14.9: UsuallyDoubleHash -- 14.10: Proof of Equation (14.12b) -- 15. Optimum Hashing -- 15.1: The Ullman / Yao Framework -- 15.1.1: The Ullman / Yao Hashing Functions -- 15.1.2: Ullman / Yao INSERT(k) and SEARCH(k) -- 15.1.3: The Ullman / Yao Statistical Model -- 15.2: The Rates at Which a Cell is Probed and Occupied -- 15.3: Partitions of (i)Scenarios, (i)Subscenarios, and Their Skeletons -- 15.3.1: (i)Subscenarios -- 15.3.2: Skeletons -- 15.4: Randomly Generated m-Scenarios -- 15.5: Bounds on Random Sums -- 15.6: Completing the Proof of Theorem 15.1 -- PART III: SOME NOVEL APPLICATIONS OF HASHING -- 16. Karp-Rabin String Searching -- 16.1: Overview -- 16.2: The Basic Karp-Rabin Hash-Fingerprint Algorithm -- 16.3: The Plain Vanilla Karp-Rabin Fingerprint Algorithm -- 16.4: Some Estimates on Prime Numbers -- 16.5: The Cost of False Matches in the Plain Vanilla Karp-Rabin Fingerprint Algorithm -- 16.6: Variations on the Plain Vanilla Karp-Rabin Fingerprint Algorithm -- 16.7: A Nonhashing Karp-Rabin Fingerprint -- 17. Hashing Rock and Roll -- 17.1: Overview of Audio Fingerprinting -- 17.2: The Basics of Fingerprinting Music -- 17.3: Haar Wavelet Coding -- 17.4: Min-Hash -- 17.5: Some Commercial Fingerprinting Products -- 18. Hashing in E-Commerce -- 18.1: The Varied Applications of Cryptography -- 18.2: Authentication -- 18.3: The Need for Certificates -- 18.4: Cryptographic Hash Functions -- 18.5: X.509 Certificates and CCIT Standardization. 18.6: The Secure Socket Layer (SSL) -- 18.7: Trust on the Web ... Trust No One Over 40! -- 18.8: MD5 -- 18.9: Criticism of MD5 -- 18.10: The Wang-Yu Collision Attack -- 18.11: Steven's Improvement to the Wang-Yu Collision Attack -- 18.12: The Chosen-Prefix Attack on MD5 -- 18.13: The Rogue CA Attack Scenario -- 18.14: The Secure Hash Algorithms -- 18.15: Criticism of SHA-1 -- 18.16: SHA-2 -- 18.17: What Now? -- Appendix 18: Sketch of the Steven's Chosen Prefix Attack -- 19. Hashing and the Secure Distribution of Digital Media -- 19.1: Overview -- 19.2: Intellectual Property (Copyrights and Patents) -- 19.3: Steganography -- 19.4: Boil, Boil, Toil ... and But First, Carefully Mix -- 19.5: Software Distribution Systems -- 19.6: Watermarks -- 19.7: An Image-Processing Technique for Watermarking -- 19.8: Using Geometric Hashing to Watermark Images -- 19.9: Biometrics and Hashing -- 19.10: The Dongle -- Appendix 19: Reed-Solomon and Hadamard Coding -- Exercises and Solutions -- INDEX. |
| Record Nr. | UNINA-9910819928003321 |
|
Konheim Alan G. <1934->
|
||
| Hoboken, New Jersey : , : John Wiley & Sons, , c2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||